Results on Homomorphic Realization of Automata by alpha_0-Products
نویسنده
چکیده
&ik, Z., Results on homomorphic realization of automata by a,-products, Theoretical Computer Science 87 (1991) 229-249. The notion of an irreducible semigroup has been fundamental to the Krohn-Rhodes decomposition. In this paper we study a similar concept and point out its equivalence with the Krohn-Rhodes irreducibility. We then use the new aspect of irreducible semigroups to provide cascade decompositions of automata in a situation when a strict letter-to-letter replacement is essential. The results are stated in terms of completeness theorems. Our terminology follows Gecseg (1986), so that the cascade composition is referred to as the cu,-product.
منابع مشابه
BL-general fuzzy automata and minimal realization: Based on the associated categories
The present paper is an attempt to study the minimal BL-general fuzzy automata which realizes the given fuzzy behavior. Of two methods applied for construction of such automaton presented here, one has been based on Myhill-Nerode's theory while the other has been based on derivatives of the given fuzzy behavior. Meanwhile, the categories of BL-general fuzzy automata and fuzzy behavior, along wi...
متن کاملOn Some Operators on Pseudovarieties
Birkhoff’s theorem [1] asserts that a class of algebras of a given type τ : T → N is a variety if and only if it is closed under operation of passing to subalgebras, homomorphic images and also arbitrary direct products. Motivated by applications of the theory of automata Eilenberg and Schützenberger considered in [2], [3] classes of finite monoids closed under subalgebras, homomorphic images a...
متن کاملReduction of BL-general L-fuzzy Automata
In this paper, we show that for any BL-general L-fuzzy automaton (BL-GLFA) there exists a complete deterministic accessible reduced BL-general L-fuzzy automaton that recognizing the behavior of the BL-GLFA. Also, we prove that for any finite realization β, there exists a minimal complete deterministic BL-GLFA recognizing β. We prove any complete deterministic accessible reduced BL-GLFA is a min...
متن کاملDirectable Fuzzy and Nondeterministic Automata
We study three notions of directability of fuzzy automata akin to the D1-, D2and D3-directability of nondeterministic automata. Thus an input word w of a fuzzy automaton is D1-directing if a fixed single state is reachable by w from all states, D2-directing if exactly the same states are reachable by w from every state, and D3-directing if there is a state reachable by w from every state. We st...
متن کاملRegular Varieties of Automata and Coequations
In this paper we use a duality result between equations and coequations for automata, proved by Ballester-Bolinches, Cosme-Llópez, and Rutten to characterize nonempty classes of deterministic automata that are closed under products, subautomata, homomorphic images, and sums. One characterization is as classes of automata defined by regular equations and the second one is as classes of automata ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Theor. Comput. Sci.
دوره 87 شماره
صفحات -
تاریخ انتشار 1991